#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=5e3+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   LL t;cin>>t;
   while(t--){
      LL n;cin>>n;
      LL x;cin>>x;
      LL sum=0;
      for(LL i=1;i<=n;i++) cin>>a[i],sum+=a[i];
      sort(a+1,a+1+n);
      if(sum==x){
         cout<<"NO"<<"\n";
      }
      else{
        cout<<"YES"<<"\n";
        LL ans=0;
        for(LL i=1;i<=n;i++){
           ans+=a[i];
           if(ans!=x){
              cout<<a[i]<<" ";
           }
           else{
             ans+=a[i+1];
             cout<<a[i+1]<<" "<<a[i]<<" ";
             i++;
           }
        }
        cout<<"\n";
      }
   }
   return 0;
}
